2 0 Fe b 20 07 The Bedwyr system for model checking over syntactic expressions

syntax. In Glynn Winskel, editor, 12th Symp. on Logic in Computer Science, pages 434–445, Warsaw, Poland, July 1997. IEEE Computer Society Press.4. Dale Miller. Abstract syntax for variable binders: An overview. In John Lloydand et. al., editors, Computational Logic CL 2000, number 1861 in LNAI, pages239–253. Springer, 2000.5. Dale Miller and Alwen Tiu. A proof theory for generic judgments. ACM Trans. on Computational Logic, 6(4):749–783, October 2005.6. Gopalan Nadathur and Natalie Linnell. Practical higher-order pattern unification with on-the-fly raising. In ICLP 2005: 21st International Logic ProgrammingConference, volume 3668 of LNCS, pages 371–386, October 2005. Springer.7. Frank Pfenning and Conal Elliott. Higher-order abstract syntax. In Proceedings of the ACM-SIGPLAN Conference on Programming Language Design and Implementation, pages 199–208. ACM Press, June 1988.8. Peter Schroeder-Heister. Definitional reflection and the completion. In R. Dyckhoff, editor, Proceedings of the 4th International Workshop on Extensions of LogicProgramming, pages 333–347. Springer-Verlag LNAI 798, 1993.9. Alwen Tiu. A Logical Framework for Reasoning about Logical Specifications. PhDthesis, Pennsylvania State University, May 2004.10. Alwen Tiu. Model checking for π-calculus using proof search. In Mart́ın Abadi andLuca de Alfaro, editors, CONCUR, volume 3653 of LNCS, pages 36–50. Springer, 2005.11. Alwen Tiu, Gopalan Nadathur, and Dale Miller. Mixing finite success and finitefailure in an automated prover. In Proceedings of ESHOL’05: Empirically Suc-cessful Automated Reasoning in Higher-Order Logics, pages 79 – 98, December